“Like the tombs of nameless kings”: Louis MacNeice’s Western Anti-Pastoral
نویسندگان
چکیده
منابع مشابه
The Nameless
A personal survey of the abortion problem in Britain, based on articles in The Observer. Paul Ferris sets out the present situation clearly for the layman and gives case-histories which are often moving. He makes it clear that the existing law is archaic and socially unjust. Abortion is very much a mental health problem and psychiatrists have recently been used as a scapegoat, because society w...
متن کاملLocally Nameless Sigma Calculus
We present a Theory of Objects based on the original functional ςcalculus by Abadi and Cardelli [1] but with an additional parameter to methods. We prove confluence of the operational semantics following the outline of Nipkow’s proof of confluence for the λ-calculus reusing his general Commutation.thy [4] a generic diamond lemma reduction. We furthermore formalize a simple type system for our ς...
متن کاملThe Complexity of Kings
A king in a directed graph is a node from which each node in the graph can be reached via paths of length at most two. There is a broad literature on tournaments (completely oriented digraphs), and it has been known for more than half a century that all tournaments have at least one king [Lan53]. Recently, kings have proven useful in theoretical computer science, in particular in the study of t...
متن کاملOn the 3-kings and 4-kings in multipartite tournaments
Koh and Tan gave a sufficient condition for a 3-partite tournament to have at least one 3-king in [K.M. Koh, B.P. Tan, Kings in multipartite tournaments, Discrete Math. 147 (1995) 171–183, Theorem 2]. In Theorem 1 of this paper, we extend this result to n-partite tournaments, where n 3. In [K.M. Koh, B.P. Tan, Number of 4-kings in bipartite tournaments with no 3-kings, Discrete Math. 154 (1996)...
متن کاملLocally Nameless Permutation Types
We define “Locally Nameless Permutation Types”, which fuse permutation types as used in Nominal Isabelle with the locally nameless representation. We show that this combination is particularly useful when formalizing programming languages where bound names may become free during execution (“extrusion”), common in process calculi. It inherits the generic definition of permutations and support, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Études irlandaises
سال: 2013
ISSN: 0183-973X,2259-8863
DOI: 10.4000/etudesirlandaises.3422